Scalable Approximate FRNN-OWA Classification
نویسندگان
چکیده
منابع مشابه
A Scalable Approximate Model Counter
Propositional model counting (#SAT), i.e., counting the number of satisfying assignments of a propositional formula, is a problem of significant theoretical and practical interest. Due to the inherent complexity of the problem, approximate model counting, which counts the number of satisfying assignments to within given tolerance and confidence level, was proposed as a practical alternative to ...
متن کاملCollective choice rules: a classification using the OWA operators
We propose a general scheme of collective choice rule that covers a number of well-known rules. Our point of departure is, first, the set of fuzzy preference relations, and second, the linguistic aggregation rule proposed by Kacprzyk [2-4]. We reconsider this rule on a more abstract level and use the OWA operators instead of Zadeh’s fuzzy linguistic quantifiers. All collective choice rules from...
متن کاملApproximate Packet Classification Caching
Most network devices such as routers and firewalls employ caches to take advantage of temporal locality of packet headers in order to speed up packet processing decisions. Traditionally, cache designs trade off time and space with the goal of balancing the overall cost and performance of the device. In this paper, we examine another axis of the design space that has not been previously consider...
متن کاملScalable Solution for Approximate Nearest Subspace Search
Finding the nearest subspace is a fundamental problem and influential to many applications. In particular, a scalable solution that is fast and accurate for a large problem has a great impact. The existing methods for the problem are, however, useless in a large-scale problem with a large number of subspaces and high dimensionality of the feature space. A cause is that they are designed based o...
متن کاملSparkk: Quality-Scalable Approximate Storage in DRAM
DRAM memory stores its contents in leaky cells that require periodic refresh to prevent data loss. The refresh operation does not only degrade system performance, but also consumes significant amounts of energy in mobile systems. Relaxed DRAM refresh has been proposed as one possible building block of approximate computing. Multiple authors have suggested techniques where programmers can specif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Fuzzy Systems
سال: 2020
ISSN: 1063-6706,1941-0034
DOI: 10.1109/tfuzz.2019.2949769